Equivalences between stochastic systems
نویسندگان
چکیده
منابع مشابه
Equivalences between stochastic systems
Time-dependent correlation functions of (unstable) particles undergoing biased or unbiased diffusion, coagulation and annihilation are calculated. This is achieved by similarity transformations between different stochastic models and between stochastic and soluble non-stochastic models. The results agree with experiments on one-dimensional annihilationcoagulation processes. PACS: 02.50.Ga, 05.4...
متن کاملEquivalences between cluster categories
Tilting theory in cluster categories of hereditary algebras has been developed in [BMRRT] and [BMR]. These results are generalized to cluster categories of hereditary abelian categories. Furthermore, for any tilting object T in a hereditary abelian category H, we verify that the tilting functor HomH(T,−) induces a triangle equivalence from the cluster category C(H) to the cluster category C(A),...
متن کاملStochastic and Spatial Equivalences for PALOMA
We concentrate our study on a recent process algebra – PALOMA – intended to capture interactions between spatially distributed agents, for example in collective adaptive systems. New agent-based semantic rules for deriving the underlying continuous time Markov chain are given in terms of State to Function Labelled Transition Systems. Furthermore we define a bisimulation with respect to an isome...
متن کاملBehavioural equivalences for fluid stochastic Petri nets
We propose fluid equivalences that allow one to compare and reduce behaviour of labeled fluid stochastic Petri nets (LFSPNs) while preserving their discrete and continuous properties. We define a linear-time relation of fluid trace equivalence and its branching-time counterpart, fluid bisimulation equivalence. Both fluid relations take into account the essential features of the LFSPNs behaviour...
متن کاملChecking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract)
Consider two synchronously communicating systems p and q over finite agents. Assume that one wants to check whether p ,~ q for one of the commonly used equivalences. We show that this question is PSPACE hard for all equivalences which lie between strong bisimulation and trace equivalences. For some equivalences exponential lower and upper bounds are proven. We also show that this problem is NP ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 1995
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/28/22/010